منابع مشابه
Unambiguous 1-uniform morphisms
If, for a morphism σ : ∆∗ → Σ∗ (where ∆ and Σ are arbitrary alphabets) and a word α ∈ ∆∗, there exists another morphism τ mapping α to σ(α), then σ is called ambiguous with respect to α ; if such a τ does not exist, then σ is unambiguous. For example, the morphism σ0 : {A,B,C}∗ → {a,b}∗ – given by σ0(A) := a, σ0(B) := a, σ0(C) := b – is ambiguous with respect to the word α0 := ABCACB, since the...
متن کاملWeakly Unambiguous Morphisms
A nonerasing morphism σ is said to be weakly unambiguous with respect to a word s if σ is the only nonerasing morphism that can map s to σ(s), i. e., there does not exist any other nonerasing morphism τ satisfying τ(s) = σ(s). In the present paper, we wish to characterise those words with respect to which there exists such a morphism. This question is nontrivial if we consider so-called length-...
متن کاملUnambiguous Erasing Morphisms in Free Monoids
[FRS06] characterises strings with an unambiguous image of an nonerasing morphism. Only few results are known when regarding all (possibly erasing) morphisms.
متن کاملSynchronizing delay for binary uniform morphisms
Circular D0L-systems are those with finite synchronizing delay. We introduce a tool called graph of overhangs which can be used to find the minimal value of synchronizing delay of a given D0L-system. By studying the graphs of overhangs, a general upper bound on the minimal value of a synchronizing delay of a circular D0L-system with a binary uniform morphism is given.
متن کاملMaking Nondeterminism Unambiguous 1
We show that in the context of nonuniform complexity, nondeterministic logarithmic space bounded computation can be made unambiguous. An analogous result holds for the class of problems reducible to context-free languages. In terms of complexity classes, this can be stated as: NL/poly = UL/poly LogCFL/poly = UAuxPDA(log n; nO(1))/poly
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Proceedings in Theoretical Computer Science
سال: 2011
ISSN: 2075-2180
DOI: 10.4204/eptcs.63.22